Ternary Covering Codes Derived from BCH Codes
نویسندگان
چکیده
منابع مشابه
Ternary Hamming and binary perfect covering codes
Given 1 1n € Z, the n-cube Q, is the graph with vertex set V : {0, l}' and ed"geset n:VT:orfi, where f' : {(r,w) e V xV: (u _ w)i:1if and only if j: i,(j:0,.'. ,n-l)), for i:0,... ,n-1. The edges of/t aresaidtohave (ortolie along) the directioni,for i 0,.. . ,n-!.Given a graph G, we say that S gVG) is a perfect dom'inating sei (or PDS) of G if every u € V(G) \ S is neighbor of exactly one verte...
متن کاملA family of ternary quasi-perfect BCH codes
In this paper we present a family of ternary quasi-perfect BCH codes. These codes are of minimum distance 5 and covering radius 3. The first member of this family is the ternary quadratic-residue code of length 13.
متن کاملMore on the covering radius of BCH codes
New lower bounds on the minimum length of terror correcting BCH codes with covering radius at most 2t are derived.
متن کاملFamilies of LDPC Codes Derived from Nonprimitive BCH Codes and Cyclotomic Cosets
Low-density parity check (LDPC) codes are an important class of codes with many applications. Two algebraic methods for constructing regular LDPC codes are derived – one based on nonprimitive narrow-sense BCH codes and the other directly based on cyclotomic cosets. The constructed codes have high rates and are free of cycles of length four; consequently, they can be decoded using standard itera...
متن کاملCodes between Bch and Rs Codes
The codes obtained as the shortened binary image of linear codes over GF(2m) are studied in detail. Their dimension is computed and it is shown that they may be used as unequal error proteetion codes.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Combinatorial Theory, Series A
سال: 1997
ISSN: 0097-3165
DOI: 10.1006/jcta.1997.2825